Discriminant Method for the Homological Monodromy of Tame Polynomials

نویسنده

  • MARIO ESCARIO GIL
چکیده

We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically equivalent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Polynomials of Simple Type

A polynomial map f : C2 → C is rational if its generic fibre, and hence every fibre, is of genus zero. It is of simple type if, when extended to a morphism f̃ : X → P1 of a compactification X of C2, the restriction of f̃ to each curve C of the compactification divisor D = X − C2 is either degree 0 or 1. The curves C on which f̃ is non-constant are called horizontal curves, so one says briefly “eac...

متن کامل

Iterated discriminants

It is shown that the discriminant of a discriminant has the same irreducible factors as the product of seven polynomials which are defined as the GCD of the generators of an elimination ideal. Under tame conditions of genericity, three of these polynomials are irreducible and generate the corresponding elimination ideal, while the four other are equal to one. Moreover the factors of two of thes...

متن کامل

Computing monodromy via continuation methods on random Riemann surfaces

We consider a Riemann surface X defined by a polynomial f(x, y) of degree d, whose coefficients are chosen randomly. Hence, we can suppose that X is smooth, that the discriminant δ(x) of f has d(d− 1) simple roots, ∆, and that δ(0) 6= 0 i.e. the corresponding fiber has d distinct points {y1, . . . , yd}. When we lift a loop 0 ∈ γ ⊂ C−∆ by a continuation method, we get d paths in X connecting {y...

متن کامل

Alternating groups as monodromy groups in positive characteristic

Let X be a generic curve of genus g defined over an algebraically closed field k of characteristic p ≥ 0. We show that for n sufficiently large there exists a tame rational map f : X → P1k with monodromy group An. This generalizes a result of Magaard–Völklein to positive characteristic.

متن کامل

Monodromy problem for the degenerate critical points

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006